Optimization of job shop scheduling problems using modified clonal selection algorithm
نویسندگان
چکیده
منابع مشابه
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechan...
متن کاملA Modified Invasive Weed Optimization Algorithm for Multiobjective Flexible Job Shop Scheduling Problems
In this paper, a modified invasive weed optimization (IWO) algorithm is presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with the criteria to minimize the maximum completion time (makespan), the total workload of machines and the workload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviour of weeds in colon...
متن کاملJob Shop Scheduling Using Genetic Algorithm
Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new algorithm for the job s...
متن کاملDynamic and Stochastic Job Shop Scheduling Problems Using Ant Colony Optimization Algorithm
Reactive scheduling is often been criticized for its inability to provide timely optimized and stable schedules. So far, the extant literature has focused on generating schedules that optimize shop floor efficiency. Only a few have considered optimizing both shop floor efficiency and schedule stability. This paper applies a unique selfadaptation mechanism of the ant colony optimization (ACO) al...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2014
ISSN: 1300-0632,1303-6203
DOI: 10.3906/elk-1212-26